Symmetric group character degrees and hook numbers
نویسندگان
چکیده
منابع مشابه
Symmetric Group Character Degrees and Hook Numbers
In this article we prove the following result: that for any two natural numbers k and `, and for all sufficiently large symmetric groups Sn, there are k disjoint sets of ` irreducible characters of Sn, such that each set consists of characters with the same degree, and distinct sets have different degrees. In particular, this resolves a conjecture most recently made by Moretó in [5]. The method...
متن کاملAFFINE SUBGROUPS OF THE CLASSICAL GROUPS AND THEIR CHARACTER DEGREES
In this paper we describe how the degrees of the irreducible characters of the affine subgroups of the classical groups under consideration can be found inductively. In [4] Gow obtained certain character degrees for all of the affine subgroups of the classical groups. We apply the method of Fischer to the above groups and, in addition to the character degrees given in [4], we obtain some ne...
متن کاملBounding the Number of Character Degrees of a Solvable Group
A difficult problem in the character theory of solvable groups is to show that the number c.d. (G) of irreducible character degrees of a solvable group G is equal to or greater than d.l. (G), the derived length of G. Isaacs [4] has shown that d.l. (G) ^ 3 c.d. (G)-2 for every solvable group. Berger [1] subsequently proved that d.l. (G) < c.d. (G) when | G | is odd. This problem belongs to the c...
متن کاملSylow Numbers from Character Tables and Integral Group Rings
G. Navarro raised the question whether the ordinary character table X(G) of a finite group G determines the Sylow numbers of G. In this note we show that this is the case when G is nilpotent-by-nilpotent, quasinilpotent, Frobenius group or a 2-Frobenius group. In particular Sylow numbers of supersoluble groups are determined by their ordinary character table. If G and H are finite groups with i...
متن کاملStanley’s character polynomials and coloured factorizations in the symmetric group
In Stanley [8], the author introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. In [9], the same author gives a conjectured combinatorial interpretation for the coefficients of the polynomials. Here, we prove the conjecture for the terms of highest degree.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 2007
ISSN: 0024-6115
DOI: 10.1112/plms/pdm028